Solving a novel multi-divisional project portfolio selection and scheduling problem

A common problem faced by organizations is how to select and schedule an optimal portfolio of projects subject various constraints, such as a limited budget. This known the project selection scheduling (PPSSP). Despite widespread nature this problem, no existing model adequately addresses sufficient set characteristics that arise in real-world problems. One contribution article proposal novel, practical class PPSSP consists multiple groups projects, proposed different sections major organization. The can be considered generalized given many specific PPSSPs reported literature generated relaxing certain constraints. As novel formulation, algorithms cannot ensure high-quality solutions problem. Thus, further design three hybrid meta-heuristic based on custom-purpose heuristic local search operator. case inspired future force (FFD) Australian Defence Force (ADF), presented exemplify applicability Results indicate obtained are acceptable quality for implementation.